1850C - Word on the Paper - CodeForces Solution


implementation strings

Please click on ads to support us..

C++ Code:

#include<bits/stdc++.h>

using namespace std;

int main(){

    int t;
    cin>>t;
    
    while(t--){
        string s[8];
        int row=-1,col=0;
        int i,j=0;
        for(i=0;i<8;i++){
            
                cin>>s[i];
                if(s[i]!="........" && row==-1){
                    row=i;
                   while(s[i][j]=='.'){
                    j++;
                   }
                    col=j;
                }
           
            }
          //  cout<<row<<"    "<<col<<endl;
        //cout<<s[row][col];
     
        while(row<8 && s[row][col]!='.'  ){
            cout<<s[row][col];
            row=row+1;
        }
          cout<<endl;
      
    }

    return 0;
}


Comments

Submit
0 Comments
More Questions

145. Binary Tree Postorder Traversal
94. Binary Tree Inorder Traversal
101. Symmetric Tree
77. Combinations
46. Permutations
226. Invert Binary Tree
112. Path Sum
1556A - A Variety of Operations
136. Single Number
169. Majority Element
119. Pascal's Triangle II
409. Longest Palindrome
1574A - Regular Bracket Sequences
1574B - Combinatorics Homework
1567A - Domino Disaster
1593A - Elections
1607A - Linear Keyboard
EQUALCOIN Equal Coins
XOREQN Xor Equation
MAKEPAL Weird Palindrome Making
HILLSEQ Hill Sequence
MAXBRIDGE Maximise the bridges
WLDRPL Wildcard Replacement
1221. Split a String in Balanced Strings
1002. Find Common Characters
1602A - Two Subsequences
1555A - PizzaForces
1607B - Odd Grasshopper
1084A - The Fair Nut and Elevator
1440B - Sum of Medians